Parallel molecular computation on digital data stored in DNA.

DNA is an incredibly dense storage medium for digital data. However, computing on the stored information is expensive and slow, requiring rounds of sequencing, in silico computation, and DNA synthesis. Prior work on accessing and modifying data using DNA hybridization or enzymatic reactions had limited computation capabilities. Inspired by the computational power of "DNA strand displacement," we augment DNA storage with "in-memory" molecular computation using strand displacement reactions to algorithmically modify data in a parallel manner. We show programs for binary counting and Turing universal cellular automaton Rule 110, the latter of which is, in principle, capable of implementing any computer algorithm. Information is stored in the nicks of DNA, and a secondary sequence-level encoding allows high-throughput sequencing-based readout. We conducted multiple rounds of computation on 4-bit data registers, as well as random access of data (selective access and erasure). We demonstrate that large strand displacement cascades with 244 distinct strand exchanges (sequential and in parallel) can use naturally occurring DNA sequence from M13 bacteriophage without stringent sequence design, which has the potential to improve the scale of computation and decrease cost. Our work merges DNA storage and DNA computing, setting the foundation of entirely molecular algorithms for parallel manipulation of digital information preserved in DNA.

Speed and Correctness Guarantees for Programmable Enthalpy-Neutral DNA Reactions†.

Molecular control circuits embedded within chemical systems to direct molecular events have transformative applications in synthetic biology, medicine, and other fields. However, it is challenging to understand the collective behavior of components due to the combinatorial complexity of possible interactions. Some of the largest engineered molecular systems to date have been constructed using DNA strand displacement reactions, in which signals can be propagated without a net change in base pairs (enthalpy neutral). This flexible and programmable component has been used for constructing molecular logic circuits, smart structures and devices, for systems with complex autonomously generated dynamics, and for diagnostics. Limiting their utility, however, strand displacement systems are susceptible to the spurious release of output in the absence of the proper combination of inputs (leak), as well as reversible unproductive binding (toehold occlusion) and spurious displacement that slow down desired kinetics. We systematize the properties of the simplest enthalpy-neutral strand displacement cascades (logically linear topology), and develop a taxonomy for the desired and undesired properties affecting speed and correctness, and trade-offs between them based on a few fundamental parameters. We also show that enthalpy-neutral linear cascades can be engineered with stronger thermodynamic guarantees to leak than non-enthalpy-neutral designs. We confirm our theoretical analysis with laboratory experiments comparing the properties of different design parameters. Our method of tackling the combinatorial complexity using mathematical proofs can guide the engineering of robust and efficient molecular algorithms.

Programming and training rate-independent chemical reaction networks.

Embedding computation in biochemical environments incompatible with traditional electronics is expected to have a wide-ranging impact in synthetic biology, medicine, nanofabrication, and other fields. Natural biochemical systems are typically modeled by chemical reaction networks (CRNs) which can also be used as a specification language for synthetic chemical computation. In this paper, we identify a syntactically checkable class of CRNs called noncompetitive (NC) whose equilibria are absolutely robust to reaction rates and kinetic rate law, because their behavior is captured solely by their stoichiometric structure. In spite of the inherently parallel nature of chemistry, the robustness property allows for programming as if each reaction applies sequentially. We also present a technique to program NC-CRNs using well-founded deep learning methods, showing a translation procedure from rectified linear unit (ReLU) neural networks to NC-CRNs. In the case of binary weight ReLU networks, our translation procedure is surprisingly tight in the sense that a single bimolecular reaction corresponds to a single ReLU node and vice versa. This compactness argues that neural networks may be a fitting paradigm for programming rate-independent chemical computation. As proof of principle, we demonstrate our scheme with numerical simulations of CRNs translated from neural networks trained on traditional machine learning datasets, as well as tasks better aligned with potential biological applications including virus detection and spatial pattern formation.

Programming Substrate-Independent Kinetic Barriers With Thermodynamic Binding Networks.

Engineering molecular systems that exhibit complex behavior requires the design of kinetic barriers. For example, an effective catalytic pathway must have a large barrier when the catalyst is absent. While programming such energy barriers seems to require knowledge of the specific molecular substrate, we develop a novel substrate-independent approach. We extend the recently-developed model known as thermodynamic binding networks, demonstrating programmable kinetic barriers that arise solely from the thermodynamic driving forces of bond formation and the configurational entropy of forming separate complexes. Our kinetic model makes relatively weak assumptions, which implies that energy barriers predicted by our model would exist in a wide variety of systems and conditions. We demonstrate that our model is robust by showing that several variations in its definition result in equivalent energy barriers. We apply this model to design catalytic systems with an arbitrarily large energy barrier to uncatalyzed reactions. Our results could yield robust amplifiers using DNA strand displacement, a popular technology for engineering synthetic reaction pathways, and suggest design strategies for preventing undesired kinetic behavior in a variety of molecular systems.

Composable Rate-Independent Computation in Continuous Chemical Reaction Networks.

Biological regulatory networks depend upon chemical interactions to process information. Engineering such molecular computing systems is a major challenge for synthetic biology and related fields. The chemical reaction network (CRN) model idealizes chemical interactions, allowing rigorous reasoning about the computational power of chemical kinetics. Here we focus on function computation with CRNs, where we think of the initial concentrations of some species as the input and the equilibrium concentration of another species as the output. Specifically, we are concerned with CRNs that are rate-independent (the computation must be correct independent of the reaction rate law) and composable ( f°g can be computed by concatenating the CRNs computing f and g). Rate independence and composability are important engineering desiderata, permitting implementations that violate mass-action kinetics, or even "well-mixedness", and allowing the systematic construction of complex computation via modular design. We show that to construct composable rate-independent CRNs, it is necessary and sufficient to ensure that the output species of a module is not a reactant in any reaction within the module. We then exactly characterize the functions computable by such CRNs as superadditive, positive-continuous, and piecewise rational linear. Thus composability severely limits rate-independent computation unless more sophisticated input/output encodings are used.

DNA punch cards for storing data on native DNA sequences via enzymatic nicking.

Synthetic DNA-based data storage systems have received significant attention due to the promise of ultrahigh storage density and long-term stability. However, all known platforms suffer from high cost, read-write latency and error-rates that render them noncompetitive with modern storage devices. One means to avoid the above problems is using readily available native DNA. As the sequence content of native DNA is fixed, one can modify the topology instead to encode information. Here, we introduce DNA punch cards, a macromolecular storage mechanism in which data is written in the form of nicks at predetermined positions on the backbone of native double-stranded DNA. The platform accommodates parallel nicking on orthogonal DNA fragments and enzymatic toehold creation that enables single-bit random-access and in-memory computations. We use Pyrococcus furiosus Argonaute to punch files into the PCR products of Escherichia coli genomic DNA and accurately reconstruct the encoded data through high-throughput sequencing and read alignment.

Effective design principles for leakless strand displacement systems.

Artificially designed molecular systems with programmable behaviors have become a valuable tool in chemistry, biology, material science, and medicine. Although information processing in biological regulatory pathways is remarkably robust to error, it remains a challenge to design molecular systems that are similarly robust. With functionality determined entirely by secondary structure of DNA, strand displacement has emerged as a uniquely versatile building block for cell-free biochemical networks. Here, we experimentally investigate a design principle to reduce undesired triggering in the absence of input (leak), a side reaction that critically reduces sensitivity and disrupts the behavior of strand displacement cascades. Inspired by error correction methods exploiting redundancy in electrical engineering, we ensure a higher-energy penalty to leak via logical redundancy. Our design strategy is, in principle, capable of reducing leak to arbitrarily low levels, and we experimentally test two levels of leak reduction for a core "translator" component that converts a signal of one sequence into that of another. We show that the leak was not measurable in the high-redundancy scheme, even for concentrations that are up to 100 times larger than typical. Beyond a single translator, we constructed a fast and low-leak translator cascade of nine strand displacement steps and a logic OR gate circuit consisting of 10 translators, showing that our design principle can be used to effectively reduce leak in more complex chemical systems.

Enzyme-free nucleic acid dynamical systems.

Chemistries exhibiting complex dynamics-from inorganic oscillators to gene regulatory networks-have been long known but either cannot be reprogrammed at will or rely on the sophisticated enzyme chemistry underlying the central dogma. Can simpler molecular mechanisms, designed from scratch, exhibit the same range of behaviors? Abstract chemical reaction networks have been proposed as a programming language for complex dynamics, along with their systematic implementation using short synthetic DNA molecules. We developed this technology for dynamical systems by identifying critical design principles and codifying them into a compiler automating the design process. Using this approach, we built an oscillator containing only DNA components, establishing that Watson-Crick base-pairing interactions alone suffice for complex chemical dynamics and that autonomous molecular systems can be designed via molecular programming languages.

Programmable chemical controllers made from DNA.

Biological organisms use complex molecular networks to navigate their environment and regulate their internal state. The development of synthetic systems with similar capabilities could lead to applications such as smart therapeutics or fabrication methods based on self-organization. To achieve this, molecular control circuits need to be engineered to perform integrated sensing, computation and actuation. Here we report a DNA-based technology for implementing the computational core of such controllers. We use the formalism of chemical reaction networks as a 'programming language' and our DNA architecture can, in principle, implement any behaviour that can be mathematically expressed as such. Unlike logic circuits, our formulation naturally allows complex signal processing of intrinsically analogue biological and chemical inputs. Controller components can be derived from biologically synthesized (plasmid) DNA, which reduces errors associated with chemically synthesized DNA. We implement several building-block reaction types and then combine them into a network that realizes, at the molecular level, an algorithm used in distributed control systems for achieving consensus between multiple agents.

Deterministic Function Computation with Chemical Reaction Networks.

Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. CRNs are widely used to describe information processing occurring in natural cellular regulatory networks, and with upcoming advances in synthetic biology, CRNs are a promising language for the design of artificial molecular control circuitry. Nonetheless, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. CRNs have been shown to be efficiently Turing-universal (i.e., able to simulate arbitrary algorithms) when allowing for a small probability of error. CRNs that are guaranteed to converge on a correct answer, on the other hand, have been shown to decide only the semilinear predicates (a multi-dimensional generalization of "eventually periodic" sets). We introduce the notion of function, rather than predicate, computation by representing the output of a function f : ℕ k → ℕ l by a count of some molecular species, i.e., if the CRN starts with x1, …, xk molecules of some "input" species X1, …, Xk , the CRN is guaranteed to converge to having f(x1, …, xk ) molecules of the "output" species Y1, …, Yl . We show that a function f : ℕ k → ℕ l is deterministically computed by a CRN if and only if its graph {(x, y) ∈ ℕ k × â„• l ∣ f(x) = y} is a semilinear set. Finally, we show that each semilinear function f (a function whose graph is a semilinear set) can be computed by a CRN on input x in expected time O(polylog ∥x∥1).

DNA as a universal substrate for chemical kinetics.

Molecular programming aims to systematically engineer molecular and chemical systems of autonomous function and ever-increasing complexity. A key goal is to develop embedded control circuitry within a chemical system to direct molecular events. Here we show that systems of DNA molecules can be constructed that closely approximate the dynamic behavior of arbitrary systems of coupled chemical reactions. By using strand displacement reactions as a primitive, we construct reaction cascades with effectively unimolecular and bimolecular kinetics. Our construction allows individual reactions to be coupled in arbitrary ways such that reactants can participate in multiple reactions simultaneously, reproducing the desired dynamical properties. Thus arbitrary systems of chemical equations can be compiled into real chemical systems. We illustrate our method on the Lotka-Volterra oscillator, a limit-cycle oscillator, a chaotic system, and systems implementing feedback digital logic and algorithmic behavior.

Robust stochastic chemical reaction networks and bounded tau-leaping.

The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to reaction rate deviations, and describe a formal connection between robustness and efficiency of simulation. Without robustness guarantees, stochastic simulation seems to require computational time proportional to the total number of reaction events. Even if the concentration (molecular count per volume) stays bounded, the number of reaction events can be linear in the duration of simulated time and total molecular count. We show that the behavior of robust systems can be predicted such that the computational work scales linearly with the duration of simulated time and concentration, and only polylogarithmically in the total molecular count. Thus our asymptotic analysis captures the dramatic speedup when molecular counts are large, and shows that for bounded concentrations the computation time is essentially invariant with molecular count. Finally, by noticing that even robust stochastic chemical reaction networks are capable of embedding complex computational problems, we argue that the linear dependence on simulated time and concentration is likely optimal.

Enzyme-free nucleic acid logic circuits.

Biological organisms perform complex information processing and control tasks using sophisticated biochemical circuits, yet the engineering of such circuits remains ineffective compared with that of electronic circuits. To systematically create complex yet reliable circuits, electrical engineers use digital logic, wherein gates and subcircuits are composed modularly and signal restoration prevents signal degradation. We report the design and experimental implementation of DNA-based digital logic circuits. We demonstrate AND, OR, and NOT gates, signal restoration, amplification, feedback, and cascading. Gate design and circuit construction is modular. The gates use single-stranded nucleic acids as inputs and outputs, and the mechanism relies exclusively on sequence recognition and strand displacement. Biological nucleic acids such as microRNAs can serve as inputs, suggesting applications in biotechnology and bioengineering.